Isomorphisms between Predicates and State Transformers

نویسندگان

  • Marcello M. Bonsangue
  • Joost N. Kok
چکیده

We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts likèpredicate', `liveness', `safety' and`predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin power domains and consider continuous, monotonic and unrestricted functions. We relate the transformers by iso-morphisms thereby extending and completing earlier results and giving a complete picture of all the relationships.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relating Multifunctions and Predicate Transformers through Closure Operators

We study relations between predicate transformers and mul-tifunctions in a topological setting based on closure operators. We give topological deenitions of safety and liveness predicates and using these predicates we deene predicate transformers. State transformers are mul-tifunctions with values in the collection of xed points of a closure operator. We derive several isomorphisms between pred...

متن کامل

Isomorphisms between Predicate and State Transformers

We study the relation between state transformers based on directed complete partial orders and predicate transformers. Concepts likèpredicate', `liveness', `safety' and`predicate transformers' are formulated in a topological setting. We treat state transformers based on the Hoare, Smyth and Plotkin powerdomains and consider continuous, monotonic and unrestricted functions. We relate the transfo...

متن کامل

Unifying wp and wlp

Boolean-valued predicates over a state space are isomorphic to its characteristic functions into {0, 1}. Enlarging that range to {−1, 0, 1} allows the definition of extended predicates whose associated transformers generalise the conventional wp and wlp. The correspondingly extended healthiness conditions include the new ‘sub-additivity’, an arithmetic inequality over predicates.

متن کامل

Predicates and Predicate Transformers for Supervisory Control of Discrete Event Dynamical Systems 1

Most discrete event system models are based on de ning the alphabet set or the set of events as a fundamental concept. In this paper, we take an alternative view of treating the state space as the fundamental concept. We approach the problem of controlling discrete event systems by using predicates and predicate transformers. Predicates have the advantage that they can concisely characterize an...

متن کامل

Predicates and Predicate Transformers for Supervisory Control of Discrete Event Dynamical Systems

Most discrete event system models are based on defining the alphabet set or the set of events as a fundamental concept. In this paper, we take an alternative view of treating the state space as the fundamental concept. We approach the problem of controlling discrete event systems by using predicates and predicate transformers. Predicates have the advantage that they can concisely characterize a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993